0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.33	% Computer   : n004.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 15:41:54 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.34	% Number of cores: 8
0.12/0.34	% Python version: Python 3.6.8
0.12/0.34	# Version: 2.6rc1-ho
0.12/0.34	# No SInE strategy applied
0.12/0.34	# Trying AutoSched0 for 59 seconds
0.12/0.37	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.12/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.12/0.37	#
0.12/0.37	# Preprocessing time       : 0.028 s
0.12/0.37	# Presaturation interreduction done
0.12/0.37	
0.12/0.37	# Proof found!
0.12/0.37	# SZS status Theorem
0.12/0.37	# SZS output start CNFRefutation
0.12/0.37	thf(choiceaxii, axiom, ![X5:($i > $i) > $o]:(X5 @ (epsii @ X5)<=?[X2:$i > $i]:X5 @ X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', choiceaxii)).
0.12/0.37	thf(ifd, axiom, (if)=(^[X1:$o, X2:$i > $i, X3:$i > $i]:epsii @ (^[X4:$i > $i]:((X1&(X4)=(X2))|(~(X1)&(X4)=(X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ifd)).
0.12/0.37	thf(conj, conjecture, ![X1:$o, X2:$i > $i, X3:$i > $i]:((if @ (X1) @ X2 @ X3)=(X3)|(if @ (X1) @ X2 @ X3)=(X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj)).
0.12/0.37	thf(c_0_3, plain, ![X11:$i > $i, X1:$o, X2:$i > $i, X3:$i > $i]:(epred1_4 @ X3 @ X2 @ X1 @ X11<=>((X1&(X11)=(X2))|(~X1&(X11)=(X3)))), inference(fof_simplification,[status(thm)],[introduced(definition)])).
0.12/0.37	thf(c_0_4, plain, ![X5:($i > $i) > $o]:(?[X2:$i > $i]:X5 @ X2=>X5 @ (epsii @ X5)), inference(fof_simplification,[status(thm)],[choiceaxii])).
0.12/0.37	thf(c_0_5, plain, ![X20:$i > $i, X21:$o, X22:$i > $i, X23:$i > $i]:((((~X21|X21|~epred1_4 @ X23 @ X22 @ X21 @ X20)&((X20)=(X23)|X21|~epred1_4 @ X23 @ X22 @ X21 @ X20))&((~X21|(X20)=(X22)|~epred1_4 @ X23 @ X22 @ X21 @ X20)&((X20)=(X23)|(X20)=(X22)|~epred1_4 @ X23 @ X22 @ X21 @ X20)))&((~X21|(X20)!=(X22)|epred1_4 @ X23 @ X22 @ X21 @ X20)&(X21|(X20)!=(X23)|epred1_4 @ X23 @ X22 @ X21 @ X20))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
0.12/0.37	thf(c_0_6, plain, ![X1:$o, X2:$i > $i, X3:$i > $i]:(if @ X1 @ X2 @ X3)=(epsii @ (epred1_4 @ X3 @ X2 @ X1)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ifd]), c_0_3])).
0.12/0.37	thf(c_0_7, plain, ![X15:($i > $i) > $o, X16:$i > $i]:(~X15 @ X16|X15 @ (epsii @ X15)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
0.12/0.37	thf(c_0_8, plain, ![X2:$i > $i, X4:$i > $i, X3:$i > $i]:(epred1_4 @ X4 @ X3 @ $true @ X2|(X2)!=(X3)), inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])])).
0.12/0.37	thf(c_0_9, plain, ![X12:$o, X13:$i > $i, X14:$i > $i]:(if @ X12 @ X13 @ X14)=(epsii @ (epred1_4 @ X14 @ X13 @ X12)), inference(variable_rename,[status(thm)],[c_0_6])).
0.12/0.37	thf(c_0_10, plain, ![X2:$i > $i, X4:$i > $i, X3:$i > $i]:(epred1_4 @ X3 @ X4 @ $false @ X2|(X2)!=(X3)), inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])])).
0.12/0.37	thf(c_0_11, negated_conjecture, ~(![X1:$o, X2:$i > $i, X3:$i > $i]:(((~X1|(if @ $true @ X2 @ X3)=(X3))&(X1|(if @ $false @ X2 @ X3)=(X3)))|((~X1|(if @ $true @ X2 @ X3)=(X2))&(X1|(if @ $false @ X2 @ X3)=(X2))))), inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[conj])])).
0.12/0.37	thf(c_0_12, plain, ![X5:($i > $i) > $o, X2:$i > $i]:(X5 @ (epsii @ X5)|~X5 @ X2), inference(split_conjunct,[status(thm)],[c_0_7])).
0.12/0.37	thf(c_0_13, plain, ![X2:$i > $i, X3:$i > $i]:epred1_4 @ X2 @ X3 @ $true @ X3, inference(er,[status(thm)],[c_0_8])).
0.12/0.37	thf(c_0_14, plain, ![X3:$i > $i, X2:$i > $i, X1:$o]:(if @ X1 @ X2 @ X3)=(epsii @ (epred1_4 @ X3 @ X2 @ X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.12/0.37	thf(c_0_15, plain, ![X3:$i > $i, X2:$i > $i]:epred1_4 @ X2 @ X3 @ $false @ X2, inference(er,[status(thm)],[c_0_10])).
0.12/0.37	thf(c_0_16, negated_conjecture, ((((~epred2_0|epred2_0)&((if @ $false @ esk1_0 @ esk2_0)!=(esk2_0)|epred2_0))&((~epred2_0|(if @ $true @ esk1_0 @ esk2_0)!=(esk2_0))&((if @ $false @ esk1_0 @ esk2_0)!=(esk2_0)|(if @ $true @ esk1_0 @ esk2_0)!=(esk2_0))))&(((~epred2_0|epred2_0)&((if @ $false @ esk1_0 @ esk2_0)!=(esk1_0)|epred2_0))&((~epred2_0|(if @ $true @ esk1_0 @ esk2_0)!=(esk1_0))&((if @ $false @ esk1_0 @ esk2_0)!=(esk1_0)|(if @ $true @ esk1_0 @ esk2_0)!=(esk1_0))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])).
0.12/0.37	thf(c_0_17, plain, ![X4:$i > $i, X3:$i > $i, X2:$i > $i]:((X2)=(X3)|~epred1_4 @ X4 @ X3 @ $true @ X2), inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])])).
0.12/0.37	thf(c_0_18, plain, ![X3:$i > $i, X2:$i > $i]:epred1_4 @ X2 @ X3 @ $true @ (if @ $true @ X3 @ X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
0.12/0.37	thf(c_0_19, plain, ![X4:$i > $i, X3:$i > $i, X2:$i > $i]:((X2)=(X3)|~epred1_4 @ X3 @ X4 @ $false @ X2), inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])])).
0.12/0.37	thf(c_0_20, plain, ![X3:$i > $i, X2:$i > $i]:epred1_4 @ X2 @ X3 @ $false @ (if @ $false @ X3 @ X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_15]), c_0_14])).
0.12/0.37	thf(c_0_21, negated_conjecture, (~epred2_0|(if @ $true @ esk1_0 @ esk2_0)!=(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.12/0.37	thf(c_0_22, plain, ![X3:$i > $i, X2:$i > $i]:(if @ $true @ X2 @ X3)=(X2), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.12/0.37	thf(c_0_23, negated_conjecture, (epred2_0|(if @ $false @ esk1_0 @ esk2_0)!=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.12/0.37	thf(c_0_24, plain, ![X2:$i > $i, X3:$i > $i]:(if @ $false @ X2 @ X3)=(X3), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.12/0.37	thf(c_0_25, negated_conjecture, ~epred2_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_22])])).
0.12/0.37	thf(c_0_26, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24])]), c_0_25]), ['proof']).
0.12/0.37	# SZS output end CNFRefutation
0.12/0.37	# Proof object total steps             : 27
0.12/0.37	# Proof object clause steps            : 16
0.12/0.37	# Proof object formula steps           : 11
0.12/0.37	# Proof object conjectures             : 7
0.12/0.37	# Proof object clause conjectures      : 4
0.12/0.37	# Proof object formula conjectures     : 3
0.12/0.37	# Proof object initial clauses used    : 8
0.12/0.37	# Proof object initial formulas used   : 3
0.12/0.37	# Proof object generating inferences   : 4
0.12/0.37	# Proof object simplifying inferences  : 13
0.12/0.37	# Training examples: 0 positive, 0 negative
0.12/0.37	# Parsed axioms                        : 5
0.12/0.37	# Removed by relevancy pruning/SinE    : 0
0.12/0.37	# Initial clauses                      : 18
0.12/0.37	# Removed in clause preprocessing      : 5
0.12/0.37	# Initial clauses in saturation        : 13
0.12/0.37	# Processed clauses                    : 70
0.12/0.37	# ...of these trivial                  : 0
0.12/0.37	# ...subsumed                          : 7
0.12/0.37	# ...remaining for further processing  : 63
0.12/0.37	# Other redundant clauses eliminated   : 2
0.12/0.37	# Clauses deleted for lack of memory   : 0
0.12/0.37	# Backward-subsumed                    : 0
0.12/0.37	# Backward-rewritten                   : 22
0.12/0.37	# Generated clauses                    : 45
0.12/0.37	# ...of the previous two non-trivial   : 55
0.12/0.37	# Contextual simplify-reflections      : 0
0.12/0.37	# Paramodulations                      : 10
0.12/0.37	# Factorizations                       : 0
0.12/0.37	# NegExts                              : 19
0.12/0.37	# Equation resolutions                 : 2
0.12/0.37	# Propositional unsat checks           : 0
0.12/0.37	#    Propositional check models        : 0
0.12/0.37	#    Propositional check unsatisfiable : 0
0.12/0.37	#    Propositional clauses             : 0
0.12/0.37	#    Propositional clauses after purity: 0
0.12/0.37	#    Propositional unsat core size     : 0
0.12/0.37	#    Propositional preprocessing time  : 0.000
0.12/0.37	#    Propositional encoding time       : 0.000
0.12/0.37	#    Propositional solver time         : 0.000
0.12/0.37	#    Success case prop preproc time    : 0.000
0.12/0.37	#    Success case prop encoding time   : 0.000
0.12/0.37	#    Success case prop solver time     : 0.000
0.12/0.37	# Current number of processed clauses  : 26
0.12/0.37	#    Positive orientable unit clauses  : 6
0.12/0.37	#    Positive unorientable unit clauses: 0
0.12/0.37	#    Negative unit clauses             : 4
0.12/0.37	#    Non-unit-clauses                  : 16
0.12/0.37	# Current number of unprocessed clauses: 5
0.12/0.37	# ...number of literals in the above   : 10
0.12/0.37	# Current number of archived formulas  : 0
0.12/0.37	# Current number of archived clauses   : 35
0.12/0.37	# Clause-clause subsumption calls (NU) : 86
0.12/0.37	# Rec. Clause-clause subsumption calls : 59
0.12/0.37	# Non-unit clause-clause subsumptions  : 2
0.12/0.37	# Unit Clause-clause subsumption calls : 15
0.12/0.37	# Rewrite failures with RHS unbound    : 0
0.12/0.37	# BW rewrite match attempts            : 48
0.12/0.37	# BW rewrite match successes           : 10
0.12/0.37	# Condensation attempts                : 0
0.12/0.37	# Condensation successes               : 0
0.12/0.37	# Termbank termtop insertions          : 1192
0.12/0.37	
0.12/0.37	# -------------------------------------------------
0.12/0.37	# User time                : 0.033 s
0.12/0.37	# System time              : 0.001 s
0.12/0.37	# Total time               : 0.034 s
0.12/0.37	# Maximum resident set size: 1644 pages
0.12/0.37	EOF